A Hungarian Algorithm for Error-Correcting Graph Matching
نویسندگان
چکیده
Bipartite graph matching algorithms become more and more popular to solve error-correcting graph matching problems and to approximate the graph edit distance of two graphs. However, the memory requirements and execution times of this method are respectively proportional to (n + m) and (n + m) where n and m are the order of the graphs. Subsequent developments reduced these complexities. However, these improvements are valid only under some constraints on the parameters of the graph edit distance. We propose in this paper a new formulation of the bipartite graph matching algorithm designed to solve efficiently the associated graph edit distance problem. The resulting algorithm requires O(nm) memory space and O(min(n,m) max(n,m)) execution times.
منابع مشابه
Epileptic seizure detection based on The Limited Penetrable visibility graph algorithm and graph properties
Introduction: Epileptic seizure detection is a key step for both researchers and epilepsy specialists for epilepsy assessment due to the non-stationariness and chaos in the electroencephalogram (EEG) signals. Current research is directed toward the development of an efficient method for epilepsy or seizure detection based the limited penetrable visibility graph (LPVG) algorith...
متن کاملPixel-to-Pixel Matching for Image Recognition Using Hungarian Graph Matching
A fundamental problem in image recognition is to evaluate the similarity of two images. This can be done by searching for the best pixel-to-pixel matching taking into account suitable constraints. In this paper, we present an extension of a zero-order matching model called the image distortion model that yields state-of-the-art classification results for different tasks. We include the constrai...
متن کاملShape Matching and Object Recognition Using Dissimilarity Measures with Hungarian Algorithm
The shape of an object is very important in object recognition. Shape matching is a challenging problem, especially when articulation and deformation of a part occur. These variations may be insignificant for human recognition but often cause a matching algorithm to give results that are inconsistent with our perception. In this paper, we propose an approach to measure similarity between shapes...
متن کاملتعبیه ی هندسی درخت درنقاط داخل یک چندضلعی با حداقل تعداد خم
In this paper we consider to embed a tree T with N vertices on a set of N points inside a simple polygon on n vertices and the goal is to minimize the number of bends. The main idea of our algorithm is modeling the problem into graph matching problem and uses the graph matching algorithms. We apply the concept of error-correction transformation and find the appropriate cost function then we per...
متن کاملError Correcting Graph Matching: On the Influence of the Underlying Cost Function
ÐThis paper investigates the influence of the cost function on the optimal match between two graphs. It is shown that, for a given cost function, there are an infinite number of other cost functions that lead, for any given pair of graphs, to the same optimal error correcting matching. Furthermore, it is shown that well-known concepts from graph theory, such as graph isomorphism, subgraph isomo...
متن کامل